Categorization in infancy: labeling induces a persisting focus on commonalities
نویسندگان
چکیده
Recent studies with infants and adults demonstrate a facilitative role of labels in object categorization. A common interpretation is that labels highlight commonalities between objects. However, direct evidence for such a mechanism is lacking. Using a novel object category with spatially separate features that are either of low or high variability across the stimulus set, we tracked 12-month-olds' attention to object features during learning and at test. Learning occurred in both conditions, but what was learned depended on whether or not labels were heard. A detailed analysis of eye movements revealed that infants in the two conditions employed different object processing strategies. In the silent condition, looking patterns were governed exclusively by the variability of object parts. In the label condition, infants' categorization performance was linked to their relative attention to commonalities. Moreover, the commonality focus persisted after learning even in the absence of labels. These findings constitute the first experimental evidence that labels induce a persistent focus on commonalities.
منابع مشابه
Labels Direct Infants’ Attention to Commonalities during Novel Category Learning
Recent studies have provided evidence that labeling can influence the outcome of infants' visual categorization. However, what exactly happens during learning remains unclear. Using eye-tracking, we examined infants' attention to object parts during learning. Our analysis of looking behaviors during learning provide insights going beyond merely observing the learning outcome. Both labeling and ...
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملLabels as Features (Not Names) for Infant Categorization: A Neurocomputational Approach
A substantial body of experimental evidence has demonstrated that labels have an impact on infant categorization processes. Yet little is known regarding the nature of the mechanisms by which this effect is achieved. We distinguish between two competing accounts: supervised name-based categorization and unsupervised feature-based categorization. We describe a neurocomputational model of infant ...
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 19 شماره
صفحات -
تاریخ انتشار 2016